Flattening single-vertex origami: The non-expansive case
نویسندگان
چکیده
منابع مشابه
Single-Vertex Origami and Spherical Expansive Motions
We prove that all single-vertex origami shapes are reachable from the open flat state via simple, non-crossing motions. We also consider conical paper, where the total sum of the cone angles centered at the origami vertex is not 2π. For an angle sum less than 2π, the configuration space of origami shapes compatible with the given metric has two components, and within each component, a shape can...
متن کاملFixed Point Theorems for Single Valued Mappings Satisfying the Ordered non-Expansive Conditions on Ultrametric and Non-Archimedean Normed Spaces
In this paper, some fixed point theorems for nonexpansive mappings in partially ordered spherically complete ultrametric spaces are proved. In addition, we investigate the existence of fixed points for nonexpansive mappings in partially ordered non-Archimedean normed spaces. Finally, we give some examples to discuss the assumptions and support our results.
متن کاملSingle-stranded DNA and RNA origami.
Self-folding of an information-carrying polymer into a defined structure is foundational to biology and offers attractive potential as a synthetic strategy. Although multicomponent self-assembly has produced complex synthetic nanostructures, unimolecular folding has seen limited progress. We describe a framework to design and synthesize a single DNA or RNA strand to self-fold into a complex yet...
متن کاملA Non-Expansive Pyramidal Morphological Image Coder
Pyramid Image Coding is a natural coding scheme for applications where progressive transmission is desired. In this kind of coder, versions of the original image at several resolution levels are formed by successive filtering and subsampling. Then, beginning from the coarsest image, the image is used to produce an estimate for the next (higher resolution) level and the error is coded and transm...
متن کاملConvergence rates with inexact non-expansive operators
In this paper, we present a convergence rate analysis for the inexact Krasnosel’skĭı– Mann iteration built from nonexpansive operators. Our results include two main parts: we first establish global pointwise and ergodic iteration–complexity bounds, and then, under a metric subregularity assumption, we establish local linear convergence for the distance of the iterates to the set of fixed points...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2010
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2010.04.002